Comparison of Context Switching Methods for Fine Grain Process Scheduling

نویسندگان

  • Thomas Benner
  • Achim Österling
چکیده

Context switching times are a major source of overhead in medium to fine grain process scheduling. We compared three different context switching techniques for non-preemptive scheduling in context of hardware/software codesign, and found major differences in performance and code size efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache-Affinity Scheduling for Fine Grain Multithreading

Cache utilisation is often very poor in multithreaded applications, due to the loss of data access locality incurred by frequent context switching. This problem is compounded on shared memory multiprocessors when dynamic load balancing is introduced and thread migration disrupts cache content. In this paper, we present a technique, which we refer to as ‘batching’, for reducing the negative impa...

متن کامل

Filaments: Efficient Support for Fine-Grain Parallelism

It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...

متن کامل

DEPARTMENT OF COMPUTER SCIENCE Filaments: Efficient Support for Fine-Grain Parallelism

It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...

متن کامل

Time Sharing Systems That Use a Partitioning Algorithm on Mesh-connected Parallel Computers

computers. Scheduling here is in principle moderate co-scheduling, with which the order of priority of the specic parallel processes is controlled per xed time. In addition, as a method to change the order of priority of parallel processes simultaneously for conducting co-scheduling, the authors proposed and installed internal synchronization which takes advantage of the synchronous clock that ...

متن کامل

Improving Processor and Cache Locality in Fine-Grain Parallel Computations using Object-Affinity Scheduling and Continuation Passing

On recent high-performance multiprocessors, there is a potential con ict between the goals of achieving the full performance potential of the hardware and providing a parallel programming environment that makes e ective use of programmer e ort. On one hand, an explicit coarse-grain programming style may appear to be necessary, both to achieve good cache performance and to limit the amount of ov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007